Two graph isomorphism polytopes
نویسنده
چکیده
The convex hull ψn,n of certain (n!) 2 tensors was considered recently in connection with graph isomorphism. We consider the convex hull ψn of the n! diagonals among these tensors. We show: 1. The polytope ψn is a face of ψn,n. 2. Deciding if a graph G has a subgraph isomorphic to H reduces to optimization over ψn. 3. Optimization over ψn reduces to optimization over ψn,n. In particular, this implies that the subgraph isomorphism problem reduces to optimization over ψn,n. AMS Subject Classification: 05A, 15A, 51M, 52A, 52B, 52C, 62H, 68Q, 68R, 68U, 68W, 90B, 90C
منابع مشابه
On the Complexity of Isomorphism Problems Related to Polytopes
We show that the problem to decide whether two (convex) polytopes are combinatorially isomorphic is graph isomorphism complete, even for simple or simplicial polytopes. On the other hand, we give a polynomial time algorithm for the polytope isomorphism problem in bounded dimension, which is based on Luks’ algorithm for the isomorphism problem of graphs of bounded maximal degree.
متن کاملOn the Complexity of Polytope Isomorphism Problems
We show that the problem to decide whether two (convex) polytopes, given by their vertex-facet incidences, are combinatorially isomorphic is graph isomorphism complete, even for simple or simplicial polytopes. On the other hand, we give a polynomial time algorithm for the combinatorial polytope isomorphism problem in bounded dimensions. Furthermore, we derive that the problems to decide whether...
متن کاملA Family of Counter Examples to an Approach to Graph Isomorphism
We give a family of counter examples showing that the two sequences of polytopes Φn,n and Ψn,n are different. These polytopes were defined recently by S. Friedland in an attempt at a polynomial time algorithm for graph isomorphism.
متن کاملGraph isomorphism and volumes of convex bodies
We show that a nontrivial graph isomorphism problem of two undirected graphs, and more generally, the permutation similarity of two given n × n matrices, is equivalent to equalities of volumes of the induced three convex bounded polytopes intersected with a given sequence of balls, centered at the origin with radii ti ∈ (0, √ n − 1), where {ti} is an increasing sequence converging to √ n − 1. T...
متن کاملAffine maps between quadratic assignment polytopes and subgraph isomorphism polytopes
We consider two polytopes. The quadratic assignment polytope QAP(n) is the convex hull of the set of tensors x⊗x, x ∈ Pn, where Pn is the set of n×n permutation matrices. The second polytope is defined as follows. For every permutation of vertices of the complete graph Kn we consider appropriate (n 2 ) × (n 2 ) permutation matrix of the edges of Kn. The Young polytope P ((n − 2, 2)) is the conv...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discrete Mathematics
دوره 309 شماره
صفحات -
تاریخ انتشار 2009